Decomposition of tournament limits
نویسنده
چکیده
The theory of tournament limits and tournament kernels (often called graphons) is developed by extending common notions for finite tournaments to this setting; in particular we study transitivity and irreducibility of limits and kernels. We prove that each tournament kernel and each tournament limit can be decomposed into a direct sum of irreducible components, with transitive components interlaced. We also show that this decomposition is essentially unique.
منابع مشابه
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions
Tournament solutions, i.e., functions that associate with each complete and asymmetric relation on a set of alternatives a non-empty subset of the alternatives, play an important role within social choice theory and the mathematical social sciences at large. Laffond et al. have shown that various tournament solutions satisfy composition-consistency, a structural invariance property based on the...
متن کاملEfficient Simulation of a Random Knockout Tournament
We consider the problem of using simulation to efficiently estimate the win probabilities for participants in a general random knockout tournament. Both of our proposed estimators, one based on the notion of “observed survivals” and the other based on conditional expectation and post-stratification, are highly effective in terms of variance reduction when compared to the raw simulation estimato...
متن کاملScheduling the Brazilian Soccer Tournament with Fairness and Broadcast Objectives
The Brazilian soccer tournament is organized every year by the Brazilian Soccer Confederation. Its major sponsor is TV Globo, the largest media group and television network in Brazil, who imposes constraints on the games to be broadcast. Scheduling the games of this tournament is a very constrained problem, with two objectives: breaks minimization (fairness) and the maximization of the revenues...
متن کاملar X iv : c s / 06 04 06 5 v 1 [ cs . D S ] 1 6 A pr 2 00 6 Algorithmic Aspects of a General Modular Decomposition Theory
This paper introduces the ulmods, a generalisation of modules for the homogeneous relations. We first present some properties of the ulmod family, then show that, if the homogeneous relation fulfills some natural axioms, the ulmod family has a unique decomposition tree. Under a certain size assumption we show that this tree can be computed in polynomial time. We apply this theory to a new tourn...
متن کاملar X iv : c s . D S / 06 04 06 5 v 1 16 A pr 2 00 6 Algorithmic Aspects of a General Modular Decomposition Theory
This paper introduces the ulmods, a generalisation of modules for the homogeneous relations. We first present some properties of the ulmod family, then show that, if the homogeneous relation fulfills some natural axioms, the ulmod family has a unique decomposition tree. Under a certain size assumption we show that this tree can be computed in polynomial time. We apply this theory to a new tourn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 67 شماره
صفحات -
تاریخ انتشار 2018